Fast Correlation Attack Algorithm with List Decoding and an Application
نویسندگان
چکیده
An improved method for the fast correlation attack on certain stream ciphers is presented. The proposed algorithm employs the following decoding approaches: list decoding in which a candidate is assigned to the list based on the most reliable information sets, and minimum distance decoding based on Hamming distance. Performance and complexity of the proposed algorithm are considered. A desirable characteristic of the proposed algorithm is its theoretical analyzibility, so that its performance can also be estimated in cases where corresponding experiments are not feasible due to the current technological limitations. The algorithm is compared with relevant recently reported algorithms, and its advantages are pointed out. Finally, the proposed algorithm is considered in a security evaluation context of a proposal (NESSIE) for stream ciphers.
منابع مشابه
A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack
An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: (i) it is more powerful and (ii) it provides a high-speed software implementation, as well as a simple hardware one, suitable for high parallel architectures. The novel algorithm is a method for the fast correlation attack with significan...
متن کاملCorrelation Attacks on Stream Cipher
Correlation attacks on stream cipher are divide and conquer attacks applied to nonlinear combination generators based on linear feedback shift registers. These are cipher text only attacks that exploit the correlation between the cipher text and the underlying shift register sequences to recover the initial state of the underlying LFSRs. Fast correlation attacks are based on use of parity check...
متن کاملImproved Fast Correlation Attack Using Low Rate Codes
In this paper we present a new and improved correlation attack based on maximum likelihood (ML) decoding. Previously the code rate used for decoding has typically been around r = 1/2. Our algorithm has low computational complexity and is able to use code rates around r = 1/2. This way we get much more information about the key bits. Furthermore, the run time for a successful attack is reduced s...
متن کاملEfficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملFast Correlation Attacks Based on Turbo Code Techniques
This paper describes new methods for fast correlation attacks on stream ciphers, based on techniques used for constructing and decoding the by now famous turbo codes. The proposed algorithm consists of two parts, a preprocessing part and a decoding part. The preprocessing part identi es several parallel convolutional codes, embedded in the code generated by the LFSR, all sharing the same inform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001